The Support of a Recognizable Series over a Zero-sum Free, Commutative Semiring is Recognizable
نویسندگان
چکیده
منابع مشابه
The Support of a Recognizable Series over a Zero-Sum Free, Commutative Semiring Is Recognizable
We show that the support of a recognizable series over a zero-sum free, commutative semiring is a recognizable language. We also give a sufficient and necessary condition for the existence of an effective transformation of a weighted automaton recognizing a series S over a zero-sum free, commutative semiring into an automaton recognizing the support of S.
متن کاملTwo Recognizable String-Matching Problems Over Free Partially Commutative Monoids
Let C be a finite alphabet, and C* the free monoid generated by Z. Let x, y E C* and x = uyv for U, v E C*. Then y is a factor of x. Moreover if u = 1, then y is a prefix of x, and if u = 1, then y is a suffix of x. Here 2. is the null word. One of the typical string matching problems over C* is the following: given a text string XEX* and a pattern string VEC*, decide whether or not y is a fact...
متن کاملRecognizable Series on Hypergraphs
We introduce the notion of Hypergraph Weighted Model (HWM) that generically associates a tensor network to a hypergraph and then computes a value by tensor contractions directed by its hyperedges. A series r defined on a hypergraph family is said to be recognizable if there exists a HWM that computes it. This model generalizes the notion of rational series on strings and trees. We prove some pr...
متن کاملCharacterizations of Recognizable Picture Series∗
We investigate power series on pictures which map pictures to elements of a semiring and provide an extension of two-dimensional languages to a quantitative setting. We will assign weights to devices, ranging from tiling systems and domino systems to picture automata. We prove that, for commutative semirings, the behaviors of weighted picture automata are precisely alphabetic projections of ser...
متن کاملRecognizable Tree Series with Discounting
We consider weighted tree automata with discounting over commutative semirings. For their behaviors we establish a Kleene theorem and an MSOlogic characterization. We introduce also weighted Muller tree automata with discounting over the max-plus and the min-plus semirings, and we show their expressive equivalence with two fragments of weighted MSO-sentences.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Cybernetica
سال: 2011
ISSN: 0324-721X
DOI: 10.14232/actacyb.20.2.2011.1